Seismographic Data Compression --Applying Modified Tunstall Coding--
نویسنده
چکیده
The Standard for the Exchange of Earthquake Data (SEED) is a commonly used file format in the seismology field. Steim1 and Steim2 compression schemes, i.e. lossless data compressions, are used in SEED format and are written in Data Description Language (DDL), which has computational limitations making it difficult to implement many standard compression algorithms. Steim1 and Steim2 are fixed compression methods, which assign each incoming data sample to fewer bits than 32-bit, regardless of the essence of the data. This project modified the Tunstall compression scheme to gain a better compression ratio of seismic data and rewrote the compressed data in the DDL of SEED format file. This project pre-computed the statistic s on seismic profile bases and,
منابع مشابه
On the Average Coding Rate of the Tunstall Code for Stationary and Memoryless Sources
The coding rate of a one-shot Tunstall code for stationary and memoryless sources is investigated in non-universal situations so that the probability distribution of the source is known to the encoder and the decoder. When studying the variable-to-fixed length code, the average coding rate has been defined as (i) the codeword length divided by the average block length. We define the average cod...
متن کاملTurbo Source Coding: A Noise-Robust Approach to Data Compression
All traditional data compression techniques, such as Huffman coding, the Lempel-Ziv algorithm, run-length limited coding, Tunstall coding and arithmetic coding are highly susceptible to residual channel errors and noise. We have recently proposed the use of parallel concatenated codes and iterative decoding for fixed-length to fixed-length source coding, i.e., turbo coding for data compression ...
متن کاملAverage Redundancy for Known Sources: Ubiquitous Trees in Source Coding∗
Analytic information theory aims at studying problems of information theory using analytic techniques of computer science and combinatorics. Following Hadamard’s precept, these problems are tackled by complex analysis methods such as generating functions, Mellin transform, Fourier series, saddle point method, analytic poissonization and depoissonization, and singularity analysis. This approach ...
متن کاملInvestigation of the Error Performance of Tunstall Coding
A lossless data compression algorithm takes a string of symbols and encodes it as a string of bits, such that the average number of bits required is less than that in the uncoded case, where all source symbols are represented by equal length codewords. Compression algorithms are only possible when some strings or some symbols in the input stream are more probable than others; these would be enc...
متن کاملRedundancy of Lossless Data Compression for Known Sources by Analytic Methods
Lossless data compression is a facet of source coding and a well studied problem of information theory. Its goal is to find a shortest possible binary code that can be unambiguously recovered. In this paper focus on rigorous analysis of code redundancy for known sources. The redundancy rate problem determines by how much the actual code length exceeds the optimal code length. We present precise...
متن کامل